On Transformations into Normal Form
نویسندگان
چکیده
منابع مشابه
Symmetries and convergence of normal form transformations
We present a survey of results about Poincaré–Dulac normal forms and normalizing transformations, with emphasis on the close connection between symmetry properties and convergence of normal form transformations. Some open problems and questions are also mentioned. No particular prerequisites are expected from the reader.
متن کاملJordan Normal Form via Elementary Transformations
This paper presents a method based on elementary transformations which may be applied to a matrix A, whose characteristic polynomial has been decomposed into linear factors, in order to obtain a nonsingular matrix P such that P-1AP is in Jordan normal form. This method can be used in the classroom, among other problems, to directly solve a linear ODE with constant coefficients. We also present ...
متن کاملTransformations into Normal Forms for Quantified Circuits
We consider the extension of Boolean circuits to quantified Boolean circuits by adding universal and existential quantifier nodes with semantics adopted from quantified Boolean formulas (QBF). The concept allows not only prenex representations of the form ∀x1∃y1...∀xn∃yn c where c is an ordinary Boolean circuit with inputs x1, ..., xn, y1, ..., yn. We also consider more general non-prenex norma...
متن کاملCompiling Knowledge into Decomposable Negation Normal Form
We propose a method for compiling proposit ional theories into a new tractable form that we refer to as decomposable negation normal form (DNNF). We show a number of results about our compilation approach. First, we show that every propositional theory can be compiled into D N N F and present an algorithm to this effect. Second, we show that if a clausal form has a bounded treewidth, then its D...
متن کاملDatabase Decomposition into Fourth Normal Form
We present an algorithm that decomposes a database scheme when the dependency set contains functional and multivalued dependencies. The schemes in the resulting decomposition are in fourth normal form and have a lossless join. Our algorithm does not impose restrictions on the allowed set of dependencies, and it never requires the computation of the full closure of the dependency set. Furthermor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1993
ISSN: 0022-247X
DOI: 10.1006/jmaa.1993.1420